A branch-and-cut algorithm for the capacitated profitable tour problem
نویسندگان
چکیده
منابع مشابه
A branch-and-cut algorithm for the capacitated profitable tour problem
A branch-and-cut algorithm for the capacitated profitable tour problem.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA branch-and-cut algorithm for capacitated network design problems
We present a branch-and-cut algorithm to solve capacitated network design problems. Given a capacitated network and point-to-point traac demands, the objective is to install more capacity on the edges of the network and route traac simultaneously, so that the overall cost is minimized. We study a mixed-integer programming formulation of the problem and identify some new facet deening inequaliti...
متن کاملA Branch-and-Cut-and-Price Algorithm for the Capacitated Location-Routing Problem
In this paper we present an exact algorithm for the Capacitated LocationRouting Problem (CLRP) based on column and cut generation. The CLRP is formulated as a set-partitioning problem which also inherits all of the known valid inequalities for the flow formulations of the CLRP. We introduce five new families of inequalities that are shown to dominate some of the cuts from the two-index formulat...
متن کاملA branch-price-and-cut algorithm for the mixed capacitated general routing problem with time windows
We introduce the Mixed Capacitated General Routing Problem with Time Windows (MCGRPTW). This problem is defined over a mixed graph, for which some nodes, arcs and edges have strictly positive demand and must be serviced through a fleet of homogeneous capacitated vehicles. The aim is to find a set of least-cost vehicle routes that satisfy this requirement, while respecting pre-specified time win...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2014
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2014.08.001